Fair Discounting Auctions

نویسندگان

  • Kamal Jain
  • Mallesh Pai
  • Rakesh Vohra
چکیده

An auctioneer sells a single unit to a group of bidders using a second price auction. A subset of these bidders possess a coupon entitling them to a discount off the winning bid in the event they win the auction. Bidders without the coupon are at a disadvantage relative to the situation when nobody has any coupons. Therefore, in a loose sense, these bidders end up sponsoring the coupon, at least partially. Furthermore the resulting allocation need not be efficient. Is there an alternative mechanism that would allow the auctioneer to offer discount coupons to a set of bidders while not harming the rest. In other words is it possible that the discount coupons are fully sponsored by the auctioneer. In this paper we propose desiderata that such a mechanism should have and bound their inefficiency.1 The question is motivated by a longstanding discount offered by Google to its AdWords customers. For every dollar spent in AdWords, one receives free processing on $10 at Google Checkouttheir standard rates are 2% of the transaction amount plus a $0.20 fixed charge. In effect, a customer who signs up with Google checkout receives a discount in the AdWords auction.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Calibration of Fair Social Discount Rate in Utilizing Iran Oil Resources: An Islamic View Point

There is a long tradition in economics about the question of whether intergenerational discounting is fair or not. Ramsey (1928) was the first economist that criticized the discounting and mentioned that the just rate of discounting is zero.  In this paper it was tried to calculate the just rate of discounting for Iran with respect to Islamic thoughts. According to Islam, intergenerational just...

متن کامل

Fair On-Line Auctions without Special Trusted Parties

Traditional face-to-face (English) auctions rely on the auctioneer to fairly interact with bidders to accept the highest bid on behalf of the seller. On-line auctions also require fair negotiation. However, unlike face-to-face auctions, on-line auctions are inherently subject to attacks because the bidders and auctioneer are not copresent. These attacks include selectively blocking bids based o...

متن کامل

Presenting and Explaining the Model of Information Transparency as an Ethical Factor in Electronic Auctions

Abstract Background: Lack of information transparency is one of the ethical risks in the field of e-commerce. The purpose of this study is to explain the model of information transparency in electronic auctions in the organization of collection and sale of proprietary property. Method: The present study was a qualitative-exploratory research and descriptive-survey research. The statistical po...

متن کامل

Social- and Self-Image Concerns in Fair-Trade Consumption: Evidence from Experimental Auctions for Chocolate

Can social interactions be used to encourage the consumption of fair-trade products? Social interactions may alter purchase behavior by triggering either self-image concerns (when one sees others' decisions without being seen) or social-image concerns (when everybody sees everyone else). A laboratory experiment is designed to identify separately these concerns, using real auctions for normal an...

متن کامل

A Strategy-Proof Online Auction with Time Discounting Values

Online mechanism design has been widely applied to various practical applications. However, designing a strategy-proof online mechanism is much more challenging than that in a static scenario due to short of knowledge of future information. In this paper, we investigate online auctions with time discounting values, in contrast to the flat values studied in most of existing work. We present a st...

متن کامل

On consistency of optimal pricing algorithms in repeated posted-price auctions with strategic buyer

We study revenue optimization learning algorithms for repeated posted-price auctions where a seller interacts with a single strategic buyer that holds a fixed private valuation for a good and seeks to maximize his cumulative discounted surplus. For this setting, first, we propose a novel algorithm that never decreases offered prices and has a tight strategic regret bound in Θ(log log T ) under ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008